Analysis for Deadlock Detection and Resolution Techniques in Distributed Database

In a distributed database environment, where the data is spread across several sites there are many concerns to deal with such as concurrency control, deadlock. Deadlocks impact the overall performance of the system. A deadlock is a condition in a system where a process cannot proceed because it needs to obtain a resource held by another process which it itself is holding a resource that the other process needs. In literature various techniques have been discussed which are used to prevent, detect and resolve the deadlocks. In this paper we have analyzed the deadlock detection and resolution techniques that are used. We have reviewed in detail the algorithms presented by B. M. Alom[2] for deadlock detection and resolution in distributed environment and found that when we rearrange the order of the transactions pair in the algorithm by Aloms[2] then it completely fails to detect the deadlocks